Information systems for continuous posets
نویسندگان
چکیده
منابع مشابه
Information Systems for Continuous Posets
The method of information systems is extended from algebraic posets to continuous posets by taking a set of tokens with an ordering that is transitive and interpolative but not necessarily reflexive. This develops results of Raney on completely distributive lattices and of Hoofman on continuous Scott domains, and also generalizes Smyth’s “R-structures”. Various constructions on continuous poset...
متن کاملPartial metrisability of continuous posets
In this article, we characterise all continuous posets which are partially metrizable in their Scott topology. We present conditions for pmetrizability, which are both necessary and sufficient, in terms of measurements, domain-theoretic bases and, in a more general setting, in terms of radially convex metrics. These conditions, together with their refinements and generalisations, set a natural ...
متن کاملGENERALIZA nON OF CONTINUOUS POSETS
In this paper we develop a general theory of continuity in partially ordered sets. Among the interesting special cases of this theory is the theory of continuous lattices developed by D. Scott, J. Lawson and others. Introduction. In this paper we are going to generalize the concept of a continuous poset, using the theory of Galois connections. In this sense we are following Hofmann and Stralka ...
متن کاملDescent Systems for Bruhat Posets
Let (W,S) be a finite Weyl group and let w ∈ W . It is widely appreciated that the descent set D(w) = {s ∈ S | l(ws) < l(w)} determines a very large and important chapter in the study of Coxeter groups. In this paper we generalize some of those results to the situation of the Bruhat poset W J where J ⊂ S. Our main results here include the identification of a certain subset S ⊂ W J that convinci...
متن کاملchannel estimation for mimo-ofdm systems
تخمین دقیق مشخصات کانال در سیستم های مخابراتی یک امر مهم محسوب می گردد. این امر به ویژه در کانال های بیسیم با خاصیت فرکانس گزینی و زمان گزینی شدید، چالش بزرگی است. مقالات متعدد پر از روش های مبتکرانه ای برای طراحی و آنالیز الگوریتم های تخمین کانال است که بیشتر آنها از روش های خاصی استفاده می کنند که یا دارای عملکرد خوب با پیچیدگی محاسباتی بالا هستند و یا با عملکرد نه چندان خوب پیچیدگی پایینی...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1993
ISSN: 0304-3975
DOI: 10.1016/0304-3975(93)90072-2